Leader election on two-dimensional periodic cellular automata

Leader Election by d Dimensional Cellular Automata

Anonymous Leader Election in One- and Two-Dimensional Cellular Automata

Leader election plays a crucial role in numerous distributed protocols, multi-agent systems and biological societies. Yet there is a fundamental gap in understanding its simplest variant, such as, in cellular automata, employing components that are fully uniform, deterministic, and anonymous. In this thesis, we investigate various oneand two-dimensional binary state cellular automata that elect...

Leader Election by d Dimensional Cellular Automata

We present a cellular algorithm in O(w) for the leader election problem on a finite connected subset F of ZZ of excentricity w, for any fixed d. The problem consists in finding an algorithm such that when setting the elements of F to a special state, and all the others to a state #, the cellular automaton iterates a finite number of steps and eventually sets only one precise element of F to a s...

An Efficient Cellular Automata based Leader Election Scheme

This work reports an efficient scheme of electing a leader, in a fully connected distributed system, having n number of nodes. In the proposed scheme, the system state is modeled using Cellular Automata. Each node is initialized with status information. This information has to be maintained by the nodes at all times so that they are aware of the current working coordinator in the system. The pr...

Improved Frog Leaping Algorithm Using Cellular Learning Automata

In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...